Variable Reduction Strategy Integrated Variable Neighborhood Search and NSGA-II Hybrid Algorithm for Emergency Material Scheduling

نویسندگان

چکیده

Developing a reasonable and efficient emergency material scheduling plan is of great significance to decreasing casualties property losses. Real-world (EMS) problems are typically large-scale possess complex constraints. An evolutionary algorithm (EA) one the effective methods for solving EMS problems. However, existing EAs still face challenges when dealing with or equality To handle above challenges, we apply idea variable reduction strategy (VRS) an problem, which can accelerate optimization process used obtain better solutions by simplifying corresponding Firstly, define allocation route model, neighborhood search NSGA-II hybrid (VNS-NSGAII) designed solve model. Secondly, utilize VRS simplify proposed model enable lower dimension fewer Furthermore, integrate VNS-NSGAII reduced prove effectiveness on VNS-NSAGII, construct two test cases, where case based multi-depot vehicle routing problem other combined initial 5·12 Wenchuan earthquake support situation. Experimental results show that improve performance standard VNS-NSGAII, enabling efficiency higher-quality solution.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independent Task Scheduling by Hybrid Algorithm of Harmony Search and Variable Neighborhood Search

A new hybrid algorithm is proposed in this paper. An independent task scheduling algorithm is designed based on the hybrid algorithm. The hybrid algorithm adopt list scheduling method to code harmony solution and convert harmony vector to priority-based independent task scheduling model, and perform variable neighborhood search on harmony solutions to improve Harmony Search efficiency and solut...

متن کامل

Flexible job-shop scheduling with parallel variable neighborhood search algorithm

Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. FJSP is NP-hard and mainly presents two difficulties. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on the machines. This paper proposes a parallel variable neighborhood search (PVNS)...

متن کامل

A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system

0020-0255/$ see front matter 2010 Elsevier Inc doi:10.1016/j.ins.2010.10.001 ⇑ Corresponding author. E-mail address: [email protected] (H. Effective task scheduling, which is essential for achieving high performance in a heterogeneous multiprocessor system, remains a challenging problem despite extensive studies. In this article, a heuristic-based hybrid genetic-variable neighborhood s...

متن کامل

Gaussian Variable Neighborhood Search for the File Transfer Scheduling Problem

This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search procedures. As Gaussian Variable Neighborhood Search showed promising results when solving continuous optimization problems, its implementation in solving the d...

متن کامل

Variable Neighborhood Search Methods

Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the Encyclopedia of Optimization.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complex system modeling and simulation

سال: 2023

ISSN: ['2096-9929']

DOI: https://doi.org/10.23919/csms.2023.0006